Proving the Impossible: Provable Route Avoidance using Alibi Routing

نویسندگان

  • Victoria Lai
  • Dave Levin
چکیده

We introduce route avoidance using alibi routing, in which a source can provably avoid a particular area when sending traffic to a destination. Our approach combines overlay routing and latency estimation using network coordinates to establish an “alibi” — a packet could not possibly have gone to the relay(s), the area to be avoided, and the destination within the considered timeframe. In our simulation over PlanetLab ping trace data, we show that geographic coordinates map well to 2-D network coordinates and allow us to reason about who can avoid whom and at what costs. We find that geography, particularly the continent and distribution of nodes, is a primary determinant of the possibility and costs of provable avoidance. We also discuss potential extensions to alibi routing, including secure network coordinates and “scaffolding” for constructing paths with multiple relays.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flaws in Endair-A Secure Routing Protocol for MANETS

Routing is the one of the essential criteria at network level in mobile ad hoc networks. Ad hoc network routing protocols are difficult to design, and secure because unable to handle rapid node mobility and network topology changes. It has been realized by many researchers, and several “secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols ha...

متن کامل

Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks

In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The proposed approach is an adaptation of the simulation paradigm that is used extensively for the analysis of cryptographic algorithms and protocols, and it provides a rigorous method for proving that a given routing protocol is sec...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Review of Routing in Ad Hoc Networks

Routing in ad hoc networks is a major criteria, which always plays a key role. A study of routing in ad hoc networks should not focus only on finding a shortest path to the destination. So, we have done a study of routing in ad hoc networks which takes into account the important factors which revolves around routing, like routing the packets through a shortest path, identifying the neighbors by...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013